Spectral asymptotics of the Laplacian on supercritical bond-percolation graphs
نویسندگان
چکیده
منابع مشابه
Spectral properties of the Laplacian on bond-percolation graphs
Bond-percolation graphs are random subgraphs of the d-dimensional integer lattice generated by a standard bond-percolation process. The associated graph Laplacians, subject to Dirichlet or Neumann conditions at cluster boundaries, represent bounded, self-adjoint, ergodic random operators with off-diagonal disorder. They possess almost surely the non-random spectrum [0, 4d] and a selfaveraging i...
متن کاملSpectral asymptotics of percolation Hamiltoni- ans on amenable Cayley graphs
In this paper we study spectral properties of adjacency and Laplace operators on percolation subgraphs of Cayley graphs of amenable, finitely generated groups. In particular we describe the asymptotic behaviour of the integrated density of states (spectral distribution function) of these random Hamiltonians near the spectral minimum. The first part of the note discusses various aspects of the q...
متن کاملAsymptotics in bond percolation on expanders
We consider supercritical bond percolation on a family of high-girth d-regular expanders. Alon, Benjamini and Stacey (2004) established that its critical probability for the appearance of a linearsized (“giant”) component is pc = 1/(d − 1). Our main result recovers the sharp asymptotics of the size and degree distribution of the vertices in the giant at any p > pc, as well as that of its 2-core...
متن کاملBond Percolation on Isoradial Graphs
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square, triangular, and other lattices. This is achieved via the star–triangle transformation, by transporting the box-crossing property across the family of isoradial ...
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2007
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2007.06.018